Integer and fractional packings in dense 3-uniform hypergraphs
نویسندگان
چکیده
Let 0 be any fixed 3-uniform hypergraph. For a 3-uniform hypergraph we define 0( ) to be the maximum size of a set of pairwise triple-disjoint copies of 0 in . We say a function from the set of copies of 0 in to [0, 1] is a fractional 0-packing of if ¥ e ( ) 1 for every triple e of . Then * 0( ) is defined to be the maximum value of ¥ 0 over all fractional 0-packings of . We show that * 0( ) 0( ) o( V( ) ) for all 3-uniform hypergraphs . This extends the analogous result for graphs, proved by Haxell and Rödl (2001), and requires a significant amount of new theory about regularity of 3-uniform hypergraphs. In particular, we prove a result that we call the Extension Theorem. This states that if a k-partite 3-uniform hypergraph is regular [in the sense of the hypergraph regularity lemma of Frankl and Rödl (2002)], then almost every triple is in about the same number of copies of Kk (3) (the complete 3-uniform hypergraph with k vertices). © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 22: 248–310, 2003
منابع مشابه
Integer and fractional packings of hypergraphs
Let F0 be a fixed k-uniform hypergraph. The problem of finding the integer F0-packing number νF0 (H) of a k-uniform hypergraph H is an NP-hard problem. Finding the fractional F0-packing number ν∗ F0 (H) however can be done in polynomial time. In this paper we give a lower bound for the integer F0-packing number νF0 (H) in terms of ν∗ F0 (H) and show that νF0 (H) ≥ ν∗ F0 (H)− o(|V (H)| k).
متن کاملInteger and Fractional Packings in Dense Graphs
Let H 0 be any xed graph. For a graph G we deene H 0 (G) to be the maximum size of a set of pairwise edge-disjoint copies of H 0 in G. We say a function from the set of copies of H 0 in G to 0; 1] is a fractional H 0-packing of G if
متن کاملEMBEDDINGS AND RAMSEY NUMBERS OF SPARSE k-UNIFORM HYPERGRAPHS
Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [6, 23] the same result was proved for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs for any integer k ≥ 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for k-uniform hypergraphs of boun...
متن کاملInteger and fractional packings in dense graphs: A simpler proof
Let H0 be a fixed connected graph. For a graph G, the H0-packing number, denoted νH0(G), is the maximum number of pairwise edge-disjoint copies of H0 in G. A function ψ from the set of copies of H0 in G to [0, 1] is a fractional H0-packing of G if ∑ e∈H ψ(H) ≤ 1 for each e ∈ E(G). The fractional H0-packing number, denoted ν H0(G), is defined to be the maximum value of ∑ H∈( G H0) ψ(H) over all ...
متن کاملD ec 2 00 6 EMBEDDINGS AND RAMSEY NUMBERS OF SPARSE k - UNIFORM HYPERGRAPHS
Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [5, 19] the same result was proved for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs for any integer k ≥ 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for k-uniform hypergraphs of boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 22 شماره
صفحات -
تاریخ انتشار 2003